A Polynomial Time Approximation Scheme for Feasibility Analysis in Static Priority Systems
نویسندگان
چکیده
Current feasibility tests for the static priority scheduling of periodic task systems run in pseudo-polynomial time. We present an approximation scheme for feasibility in static priority systems that runs in polynomial time. This test is an approximation with respect to the amount of processor’s capacity that must be “sacrificed” for the test to become exact. We show that an arbitrary level of accuracy, 2, may be chosen for the approximation scheme, and present a run-time bound that is polynomial in terms of 2 and the number of tasks, n.
منابع مشابه
Approximation Algorithms for Feasibility Analysis in Real - Time Static - Priority Systems ∗
Feasibility tests determine whether it is possible for a given real-time system to always meet all of its timing constraints on a specified processing platform. Current feasibility tests for the uniprocessor static-priority scheduling of sporadic task systems run in pseudo-polynomial time. We present a fully polynomial-time approximation scheme (FPTAS) for feasibility analysis in static-priorit...
متن کاملApproximate Feasibility Analysis and Response-Time Bounds of Static-Priority Tasks with Release Jitters
We consider static-priority tasks with constraineddeadlines that are subjected to release jitter. We define an approximate worst-case response-time analysis and propose a polynomial-time algorithm. For that purpose, we extend the Fully Polynomial-Time Approximation Scheme (FPTAS) presented in [6] to take into account release jitter constraints; this feasibility test is then used to define a pol...
متن کاملApproximating Response Times of Static-Priority Tasks with Release Jitters
We consider static-priority tasks with constraineddeadlines that are subjected to release jitters. We define an approximate worst-case response time analysis and we propose a polynomial time algorithm. For that purpose, we extend the Fully Polynomial Time Approximation Scheme (FPTAS) presented in [2] to take into account release jitters; this feasibility test is then used to define a polynomial...
متن کاملOn the Complexity of Scheduling Conditional Real-Time Code
Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when triggered by external events require to be executed within a given deadline from the triggering time. The feasibility analysis problem for such a real-time system asks whether it is possible to schedule all such blocks of code s...
متن کاملImproved approximate response time bounds for static-priority tasks
We consider sporadic tasks with static priorities and constrained deadlines to be executed upon a uniprocessor platform. Pseudo-polynomial time algorithms are known for computing worst-case response times for this task model. Some applications require to evaluate efficiently upper bounds of response times. For this purpose, we propose parametric algorithms that allow to make a tradeoff between ...
متن کامل